On constructing permutations of finite fields

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On constructing permutations of finite fields

Motivated by several constructions of permutation polynomials done by several authors (most notably by Zieve), we propose a unified treatment for a large set of classes of permutation polynomials of Fq. Our approach yields a recipe for constructing several new and old classes of permutation polynomials of Fq.

متن کامل

Constructing permutations of finite fields via linear translators

We study the permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn is a linear translator of f : Fqn → Fq. We determine the cycle structure and the inverse of such a permutation. We describe several families of permutation polynomials obtained using functions with linear translators.

متن کامل

Permutations of finite fields with prescribed properties

For cryptographic applications, the behaviour of the difference map is of importance and since there are no perfect nonlinear (PN) permutations, almost perfect nonlinear (APN) permutations have attracted a lot of attention in the last decades. Costas permutations, which are also extreme with respect to the behaviour of their difference maps, were originally introduced in connection with applica...

متن کامل

Permutations, hyperplanes and polynomials over finite fields

Starting with a result in combinatorial number theory we prove that (apart from a couple of exceptions that can be classified), for any elements a1, . . . , an of GF (q), there are distinct field elements b1, . . . , bn such that a1b1 + · · ·+ anbn = 0. This implies the classification of hyperplanes lying in the union of the hyperplanes Xi = Xj in a vector space over GF (q), and also the classi...

متن کامل

On Permutations Induced by Tame Automorphisms over Finite Fields

The present paper deals with permutations induced by tame automorphisms over finite fields. The first main result is a formula for determining the sign of the permutation induced by a given elementary automorphism over a finite field. The second main result is a formula for determining the sign of the permutation induced by a given affine automorphism over a finite field. We also give a combini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2011

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2010.10.002